Computing Persistent Homology
نویسندگان
چکیده
منابع مشابه
Computing homology and persistent homology using iterated Morse decomposition
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph theoretical operations. We use iterated Morse decomposition, which allows us to sidetrack many problems related to the standard discrete Morse theory. In particu...
متن کاملComputing Persistent Homology via Discrete Morse Theory
This report provides theoretical justification for the use of discrete Morse theory for the computation of homology and persistent homology, an overview of the state of the art for the computation of discrete Morse matchings and motivation for an interest in these computations, particularly from the point of view of topological data analysis. Additionally, a new simulated annealing based method...
متن کاملA Computing Persistent Homology within Coq/SSReflect
Jónathan Heras, School of Computing, University of Dundee, UK Thierry Coquand, Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Sweden Anders Mörtberg, Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Sweden Vincent Siles, Department of Computer Science and Engineering, ...
متن کاملIncremental-Decremental Algorithm for Computing AT-Models and Persistent Homology
In this paper, we establish a correspondence between the incremental algorithm for computing AT-models [8,9] and the one for computing persistent homology [6,14,15]. We also present a decremental algorithm for computing AT-models that allows to extend the persistence computation to a wider setting. Finally, we show how to combine incremental and decremental techniques for persistent homology co...
متن کاملClear and Compress: Computing Persistent Homology in Chunks
We present a parallelizable algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then simplifying the unpaired columns, and finally applying standard reduction on the simplified matrix. The approach generalizes a technique by Günther et al., which use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2004
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-004-1146-y